Improvement on asymptotic density of packing families derived from multiplicative lattices
نویسنده
چکیده
Let ω = (−1 + √ −3)/2. For any lattice P ⊆ Zn, P = P + ωP is a subgroup of On K , where OK = Z[ω] ⊆ C. As C is naturally isomorphic to R2, P can be regarded as a lattice in R2n. Let P be a multiplicative lattice (principal lattice or congruence lattice) introduced by Rosenbloom and Tsfasman. We concatenate a family of special codes with tP · (P + ωP ), where tP is the generator of a prime ideal P of OK . Applying this concatenation to a family of principal lattices, we obtain a new family with asymptotic density exponent λ > −1.26532182283, which is better than −1.87 given by Rosenbloom and Tsfasman considering only principal lattice families. For a new family based on congruence lattices, the result is λ > −1.26532181404, which is better than −1.39 by considering only congruence lattice families.
منابع مشابه
On the construction of dense lattices with a given automorphism group
We consider the problem of constructing dense lattices of Rn with a given non trivial automorphism group. We exhibit a family of such lattices of density at least cn2−n, which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions n, we exhibit a finite set of lattices that come with an automorphism group of size n, and a co...
متن کاملExactly solvable disordered sphere-packing model in arbitrary-dimensional Euclidean spaces.
We introduce a generalization of the well-known random sequential addition (RSA) process for hard spheres in d-dimensional Euclidean space Rd. We show that all of the n-particle correlation functions of this nonequilibrium model, in a certain limit called the "ghost" RSA packing, can be obtained analytically for all allowable densities and in any dimension. This represents the first exactly sol...
متن کاملOn the construction of dense lattices with a given automorphisms group
— We consider the problem of constructing dense lattices in Rn with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least cn2−n, which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions n, we exhibit a finite set of lattices that come with an automorphisms group of size n, and ...
متن کاملRandom Ensembles of Lattices from Generalized Reductions
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower bound). Specializing to number field lattices, we obtain a number of interesting corollaries for i...
متن کاملA note on S-packing colorings of lattices
Let a1, a2, . . . , ak be positive integers. An (a1, a2, . . . , ak)-packing coloring of a graph G is a mapping from V (G) to {1, 2, . . . , k} such that vertices with color i have pairwise distance greater than ai. In this paper, we study (a1, a2, . . . , ak)packing colorings of several lattices including the infinite square, triangular, and hexagonal lattices. For k small, we determine all ai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 36 شماره
صفحات -
تاریخ انتشار 2015